منابع مشابه
Computing Covers Using Prefix Tables
An indeterminate string x = x[1..n] on an alphabet Σ is a sequence of nonempty subsets of Σ; x is said to be regular if every subset is of size one. A proper substring u of regular x is said to be a cover of x iff for every i ∈ 1..n, an occurrence of u in x includes x[i]. The cover array γ = γ[1..n] of x is an integer array such that γ[i] is the longest cover of x[1..i]. Fifteen years ago a com...
متن کاملEnhanced Covers of Regular & Indeterminate Strings using Prefix Tables
A cover of a string x = x[1..n] is a proper substring u of x such that x can be constructed from possibly overlapping instances of u. A recent paper [12] relaxes this definition — an enhanced cover u of x is a border of x (that is, a proper prefix that is also a suffix) that covers a maximum number of positions in x (not necessarily all) — and proposes efficient algorithms for the computation o...
متن کاملEnhanced Covers of Regular and Indeterminate Strings Using Prefix Tables
A cover of a string x = x[1..n] is a proper substring u of x such that x can be constructed from possibly overlapping instances of u. A recent paper [12] relaxes this definition — an enhanced cover u of x is a border of x (that is, a proper prefix that is also a suffix) that covers a maximum number of positions in x (not necessarily all) — and proposes efficient algorithms for the computation o...
متن کاملLearning Functions of Halfspaces using Prefix Covers
We present a simple query-algorithm for learning arbitrary functions of k halfspaces under any product distribution on the Boolean hypercube. Our algorithms learn any function of k halfspaces to within accuracy ε in time O((nk/ε)) under any product distribution on {0, 1} using read-once branching programs as a hypothesis.. This gives the first poly(n, 1/ε) algorithm for learning even the inters...
متن کاملReverse Engineering Prefix Tables
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the design of the most efficient string-matching and pattern extraction algorithms. These tables can be computed in linear time independently of the alphabet size. We give an algorithmic characterisation of a Prefix table (it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.05.019